New Parallel Matrix Multiplication Algorithms for Wormhole-Routed All-Port 2D/3D Torus Networks
نویسندگان
چکیده
New matrix multiplication algorithms are proposed for massively parallel supercomputers with 2D/3D, all-port torus interconnection networks. The proposed algorithms are based on the traditional row-by-column multiplication matrix product model and employ a special routing pattern for better scalability. They compare favorably to the variants of Cannon’s and DNS algorithms since they allow matrices of the same size to be multiplied on a higher number of processors due to lower data communication overhead . Keywords-Fast Matrix Multiplication, Parallel Processing, Torus Interconnection Networks, 2D Torus, 3D Torus.
منابع مشابه
A New Parallel Matrix Multiplication Algorithm for Wormhole-Routed All-Port 2D/3D Torus Networks
A new matrix multiplication algorithm is proposed for massively parallel supercomputers with 2D/3D, all-port torus interconnection networks. The proposed algorithm is based on the traditional row-by-column multiplication matrix product model and employs a special routing pattern for better scalability. It compares favorably to the variants of Cannon’s and DNS algorithms since it allows matrices...
متن کاملA Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
A new approach to broadcast in wormhole-routed two-and three-dimensional torus networks is proposed. The approach extends the concept of dominating sets from graph theory by accounting for the relative distance-insensitivity of the wormhole routing switching strategy and by taking advantage of an all-port communication architecture. The resulting broadcast operation is based on a tree structure...
متن کاملNear-Optimal Broadcast in All-Port Wormhole-Routed 3D Tori with Dimension-Ordered Routing
The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optima...
متن کاملAlgorithms for All-to-All Personalized Exchange in 2D and 3D Tori
The inter-processor all-to-all communication patterns can be found in many important parallel algorithms. This paper presents new algorithms for all-to-all personalized exchange for circuit switched or wormhole routed 2D and 3D torus connected multiprocessors. The algorithms use message combining to minimize message startups at the expense of larger message sizes. The unique feature of these al...
متن کاملA Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several subgraphs similar to the original one, and identifying a characteristic low-dimensional subgraph from these subgraphs. The source message is first scattered in the characteristic low-dimensional subgraph of the original ...
متن کامل